Enhanced Merit Order and Augmented Lagrange Hopfield Network for Unit Commitment

نویسندگان

  • Vo Ngoc Dieu
  • Weerakorn Ongsakul
چکیده

This paper presents an enhanced merit order (EMO) and augmented Lagrange Hopfield network (ALHN) for unit commitment (UC). The EMO method is a merit order based heuristic search for unit scheduling and ALHN is a continuous Hopfield network based on augmented Lagrange relaxation for economic dispatch problem. First, generating units are sorted in ascending average production cost and committed to fulfill load demand and spinning reserve requirements neglecting minimum up and down time constraints. Then, a heuristic search based algorithm is applied to satisfy minimum up and down time constraints, and modify start up cost from cold to hot if necessary. Finally, the ALHN is used to solve economic dispatch (ED). The proposed method is tested on systems ranging from 10 to 100 generating units and compared to augmented Hopfield network (AHN), conventional Lagrangian relaxation (LR), genetic algorithm (GA), evolutionary programming (EP), Lagrangian relaxation and genetic algorithm (LRGA), memetic algorithm (MA), Lagrangian relaxation and memetic algorithm (LRMA), genetic algorithm based on unit characteristic classification (GAUC), genetic algorithm based on unit characteristic classification and unit integration technique (GAUCUI), and extended priority list (EPL). The total production costs from the proposed method are less expensive and the computational times are vastly faster than the others, especially for the large number of generating units. For large-scale implementation, it is also tested on systems up to 1000 generating units with time horizon up to 168 hours. Test results indicate that the proposed method is very attractive and favorable due to substantial production costs savings and fast computational times.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced augmented Lagrange Hopfield network for economic dispatch with piecewise quadratic cost functions

This paper proposes a simple enhanced augmented Hopfield Lagrange neural network (EALH) for solving economic dispatch (ED) problem with piecewise quadratic cost functions. The EALH is an augmented Lagrange Hopfield neural network (ALH), which is a combination of continuous Hopfield neural network and augmented Lagrangian relaxation function as its energy function, enhanced by a heuristic search...

متن کامل

Economic Dispatch with Emission and Transmission Constraints by Augmented Lagrange Hopfield Network

This paper proposes an augmented Lagrange Hopfield network (ALHN) for solving economic dispatch (ED) problem with ramp rate, emission and transmission constraints. The proposed ALHN method is the continuous Hopfield neural network with its energy function based on augmented Lagrangian function. In ALHN, the energy function is augmented by Hopfield terms from Hopfield neural network and penalty ...

متن کامل

Combined Heat and Power Economic Dispatch by Augmented Lagrange Hopfield Network

This paper proposes an augmented Lagrange Hopfield network (ALHN) for combined heat and power economic dispatch (CHPED) problem. The ALHN method is the continuous Hopfield neural network with its energy function based on augmented Lagrangian relaxation. In the proposed ALHN, the energy function is augmented by Hopfield terms from Hopfield neural network and penalty factors from augmented Lagran...

متن کامل

Relaxation labeling using augmented lagrange-hopfield method

A novel relaxation labeling (RL) method is presented based on Augmented Lagrangian multipliers and the graded Hoppeld neural network (ALH). In this method, an RL problem is converted into a constrained optimization problem and solved by using the augmented Lagrangian and Hoppeld techniques. The ALH method yields results comparable to the best of the existing RL algorithms in terms of the optimi...

متن کامل

Solving Combinatorial Optimization Problems Using Augmented Lagrange Chaotic Simulated Annealing

Chaotic simulated annealing (CSA) proposed by Chen and Aihara has been successfully used to solve a variety of combinatorial optimization problems. CSA uses a penalty term to enforce solution validity as in the original Hopfield-Tank approach. There exists a conflict between solution quality and solution validity in the penalty approach. It is often difficult to adjust the relative magnitude of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005